Forcing Isomorphism
نویسندگان
چکیده
If two models of a first order theory are isomorphic then they remain isomorphic in any forcing extension of the universe of sets. In general, however, such a forcing extension may create new isomorphisms. For example, any forcing that collapses cardinals may easily make formerly non-isomorphic models isomorphic. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is said to be classifiable if it is superstable and does not have either the dimensional order property (DOP) or the omitting types order property (OTOP). Shelah has shown [7] that if a theory T is classifiable then each model of cardinality λ is described by a sentence of
منابع مشابه
Changing the heights of automorphism towers by forcing with Souslin trees over L
We prove that there are groups in the constructible universe whose automorphism towers are highly malleable by forcing. This is a consequence of the fact that, under a suitable diamond hypothesis, there are sufficiently many highly rigid non-isomorphic Souslin trees whose isomorphism relation can be precisely controlled by forcing.
متن کاملDense subtrees in complete Boolean algebras
Every good introduction to set-theoretic forcing starts with basic forcing algebras like ”adding a Cohen real” or ”adding a Cohen subset of ω1”. It seems that these algebras are particularly simple mainly because they contain a dense subtree, so we might as well pretend we are forcing with a tree. Such a forcing is especially easy to visualize as the generic object will be a branch through the ...
متن کاملForcing Isomorphism II
If T has only countably many complete types, yet has a type of infinite multiplicity then there is a c.c.c. forcing notion Q such that, in any Q-generic extension of the universe, there are non-isomorphic models M1 and M2 of T that can be forced isomorphic by a c.c.c. forcing. We give examples showing that the hypothesis on the number of complete types is necessary and what happens if ‘c.c.c.’ ...
متن کاملThe Bounded Proper Forcing Axiom
The bounded proper forcing axiom BPFA is the statement that for any family of א1 many maximal antichains of a proper forcing notion, each of size א1, there is a directed set meeting all these antichains. A regular cardinal κ is called Σ1-reflecting, if for any regular cardinal χ, for all formulas φ, “H(χ) |= ‘φ’ ” implies “∃δ<κ, H(δ) |= ‘φ’ ” We show that BPFA is equivalent to the statement tha...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 58 شماره
صفحات -
تاریخ انتشار 1993